Counterexamples to witness conjectures
نویسنده
چکیده
Consider the class of exp-log constants, which is constructed from the integers using the field operations, exponentiation and logarithm. Let z be such an exp-log constant and let n be its size as an expression. Witness conjectures attempt to give bounds $(n) for the number of decimal digits which need to be evaluated in order to test whether z equals zero. For this purpose, it is convenient to assume that exponentials are only applied to arguments with absolute values bounded by 1. In that context, several witness conjectures have appeared in the literature and the strongest one states that it is possible to choose $(n) = O(n). In this paper we give a counterexample to this conjecture. We also extend it so as to cover similar, polynomial witness conjectures.
منابع مشابه
A computational attack on the conjectures of Graffiti: New counterexamples and proofs
Graffiti is a computer program that checks for relationships among certain graph invariants. It uses a database of graphs and has generated well over 700 conjectures. Having obtained a readily available computer tape of all the nonisomorphic graphs with 10 or fewer vertices, we have tested approximately 200 of the Graffiti conjectures and have found counterexamples for over 40 of them. For each...
متن کاملCounterexamples to three conjectures concerning perfect graphs
We will present counterexamples to a conjecture of Hoàng, a conjecture of Hertz and de Werra and to a conjecture of Reed. All these three conjectures are related to perfect graphs.
متن کاملIntegrating Testing and Interactive Theorem Proving
Using an interactive theorem prover to reason about programs involves a sequence of interactions where the user challenges the theorem prover with conjectures. Invariably, many of the conjectures posed are in fact false, and users often spend considerable effort examining the theorem prover’s output before realizing this. We present a synergistic integration of testing with theorem proving, imp...
متن کاملTableaux and Witnesses for the -calculus
Symbolic temporal logic model checking is an automatic veriication method. One of its main features is that a counterexample can be constructed when a temporal formula does not hold for the model. Most model checkers so far have restricted the type of formulae that can be checked and for which counterexamples can be constructed to fair CTL formulae. This paper shows how counterexamples and witn...
متن کاملCounterexamples to the Poset Conjectures of Neggers, Stanley, and Stembridge
We provide the first counterexamples to Neggers’ 1978 conjecture and Stembridge’s 1997 conjecture that the generating functions for descents and peaks in the linear extensions of naturally labeled posets should have all real zeros. We also provide minimum-sized counterexamples to a generalization of the Neggers conjecture due to Stanley that was recently disproved by Brändén.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Symb. Comput.
دوره 41 شماره
صفحات -
تاریخ انتشار 2006